The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience)

نویسنده

  • Yasuhito Tanaka
چکیده

This paper is an attempt to examine the main theorems of social choice theory from the viewpoint of constructive mathematics. We examine the Gibbard–Satterthwaite theorem [A.F. Gibbard, Manipulation of voting schemes: a general result, Econometrica 41 (1973) 587–601; M.A. Satterthwaite, Strategyproofness and Arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions, Journal of Economic Theory 10 (1975) 187–217] in a society with an infinite number of individuals (infinite society). We will show that the theorem that any coalitionally strategy-proof social choice function may have a dictator or has no dictator in an infinite society is equivalent to LPO (limited principle of omniscience). Therefore, it is non-constructive. A dictator of a social choice function is an individual such that if he strictly prefers an alternative (denoted by x) to another alternative (denoted by y), then the social choice function chooses an alternative other than y. Coalitional strategy-proofness is an extension of the ordinary strategy-proofness. It requires non-manipulability for coalitions of individuals as well as for a single individual. 2007 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society

This paper investigates the computability problem of the Gibbard–Satterthwaite theorem [A.F. Gibbard, Manipulation of voting schemes: a general result, Econometrica 41 (1973) 587–601; M.A. Satterthwaite, Strategyproofness and Arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions, Journal of Economic Theory 10 (1975) 187–217] of social choic...

متن کامل

A topological proof of Eliaz's unified theorem of social choice theory

Recently Eliaz (2004) has presented a unified framework to study (Arrovian) social welfare functions and non-binary social choice functions based on the concept of preference reversal. He showed that social choice rules which satisfy the property of preference reversal and a variant of the Pareto principle are dictatorial. This result includes the Arrow impossibility theorem (Arrow (1963)) and ...

متن کامل

Social Choice Theory in HOL Arrow and Gibbard-Satterthwaite

This article presents formalizations in higher-order logic of two proofs of Arrow’s impossibility theorem due to Geanakoplos. The Gibbard-Satterthwaite theorem is derived as a corollary. Lacunae found in the literature are discussed.

متن کامل

Between Arrow and Gibbard-Satterthwaite; A representation theoretic approach

A central theme in social choice theory is that of impossibility theorems, such as Arrow’s theorem [Arr63] and the Gibbard-Satterthwaite theorem [Gib73, Sat75], which state that under certain natural constraints, social choice mechanisms are impossible to construct. In recent years, beginning in Kalai [Kal01], much work has been done in finding robust versions of these theorems, showing “approx...

متن کامل

A Computer-Aided Proof to Gibbard-Satterthwaite Theorem

The Gibbard-Satterthwaite Theorem is a landmark result in both social choice theory and implementation theory, as it bridges normative and strategic analysis of voting problems. The theorem states that any social choice function that is strategy-proof and onto is also dictatorial. In this paper, we provide a computer-aided inductive proof for the theorem. We first show that this result holds if...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 193  شماره 

صفحات  -

تاریخ انتشار 2007